Online Graph Coloring Against a Randomized Adversary
نویسندگان
چکیده
منابع مشابه
Randomized Online Graph Coloring (Preliminary Version)
In this paper we study the problem of coloring graphs in an online manner. The only known deterministic online graph coloring algorithm with a sublinear performance function was found by Lov&z, Saks and Trotter [5]. Their algorithm colors graphs of c h r s matic number x with no more than ((2xn)/log*n) colors, where n is the number of vertices. They point out that the performance can be improve...
متن کاملEstimating Uncertainty Online Against an Adversary
Assessing uncertainty is an important step towards ensuring the safety and reliability of machine learning systems. Existing uncertainty estimation techniques may fail when their modeling assumptions are not met, e.g. when the data distribution differs from the one seen at training time. Here, we propose techniques that assess a classification algorithm’s uncertainty via calibrated probabilitie...
متن کاملdynamic coloring of graph
در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...
15 صفحه اولA practical algorithm for [r, s, t]-coloring of graph
Coloring graphs is one of important and frequently used topics in diverse sciences. In the majority of the articles, it is intended to find a proper bound for vertex coloring, edge coloring or total coloring in the graph. Although it is important to find a proper algorithm for graph coloring, it is hard and time-consuming too. In this paper, a new algorithm for vertex coloring, edge coloring an...
متن کاملRandomized Lower Bounds for Online Path Coloring
We study the power of randomization in the design of online path coloring algorithms. No specific network topology for which randomized online algorithms perform substantially better than deterministic algorithms is known until now. We present randomized lower bounds for online coloring on some well studied network topologies. We show that no randomized algorithm for online coloring of interval...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2018
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s0129054118410058